package jjn.round1;

import commons.ListNode;

/**
 * 合并两个有序链表 - 递归解法
 *
 * @author Jjn
 * @since 2022/8/28 23:44
 */
public class LeetCode21_MergeTwoLinkedListSolution2 {
    public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
        if (list1 == null) {
            return list2;
        } else if (list2 == null) {
            return list1;
        } else if (list1.val < list2.val) {
            list1.next = mergeTwoLists(list1.next, list2);
            return list1;
        } else {
            list2.next = mergeTwoLists(list2.next, list1);
            return list2;
        }
    }
}
